Experimental Determination and Calculation of the Wire Drawing Force in Monolithic Dies on Straight-Line Drawing Machines

Straight-Line Drawing of Quadrangulations

This article introduces a straight-line drawing algorithm for quadrangulations, in the family of the face-counting algorithms. It outputs in linear time a drawing on a regular W×H grid such that W+H = n − 1 −∆, where n is the number of vertices and ∆ is an explicit combinatorial parameter of the quadrangulation.

Planar Straight-Line Drawing Algorithms

Luca Vismara — 10.

On Extending a Partial Straight-Line Drawing

In this paper we investigate the computational complexity of the following problem. Given a planar graph in which some vertices have already been placed in the plane (i.e., a partial embedding), place the remaining vertices to form a planar straight-line drawing of the graph. We show that the above extensibility problem, mentioned in the 2003 paper “Selected Open Problems in Graph Drawing” [1],...

Orthogonal Straight Line Drawing of Trees

Transversal Structures on Triangulations, with Application to Straight-Line Drawing

We define and investigate so-called transversal structures related to triangulations without separating triangles, which are equivalent to the regular edge labelings discovered by Kant and He. We study other properties of transversal structures and show that they give rise to a new straight-line drawing algorithm for triangulations without separating triangles, and more generally for 4-connecte...